The Friendly Stars
نویسندگان
چکیده
منابع مشابه
Unweighted p-center problem on extended stars
An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph asks to find a subset of the vertices of of cardinality such that the maximum weighted distances from to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.
متن کاملThe Contention-Friendly Tree
This paper proposes a new lock-based concurrent binary tree using a methodology for writing concurrent data structures. This methodology limits the high contention induced by today’s multicore environments to come up with efficient alternatives to the most widely used search structures. Data structures are generally constrained to guarantee a big-oh step complexity even in the presence of concu...
متن کاملLINEAR PULSATION CHARACTERISTICS OF MIRA VARIABLE STARS
The linear adiabatic pulsation-periods of Mira variable stars have been derived. Approximately 2701[1]models were calculated for M = 0.7 MΘ to 2 MΘ stars with radii from 180 RΘ to 340 RΘ and luminosities from 2800 LΘ to 10,000 LΘ. The chemical composition of all models is (X,Z) = (0.7,0.02). From the result of this study, linear relations on Luminosity-Period-Mass relationship and luminosity-pe...
متن کاملCasper the Friendly Finality Gadget
We introduce Casper, a proof of stake-based finality system which overlays an existing proof of work blockchain. Casper is a partial consensus mechanism combining proof of stake algorithm research and Byzantine fault tolerant consensus theory. We introduce our system, prove some desirable features, and show defenses against long range revisions and catastrophic crashes. The Casper overlay provi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1907
ISSN: 0028-0836,1476-4687
DOI: 10.1038/076412b0